Monitoring Modulo Theories (STTT, 2015)
نویسندگان
چکیده
This paper considers a generic approach to runtime verification of temporal properties over firstorder theories. This allows especially for the verification of multi-threaded, object-oriented systems. It presents a general framework lifting monitor synthesis procedures for propositional temporal logics to a temporal logic over structures within some first-order theory. To evaluate such specifications SMT solving and classical monitoring of propositional temporal properties are combined. The monitoring procedure was implemented for linear-time temporal logic (LTL) based on the Z3 SMT solver and evaluated regarding runtime performance.
منابع مشابه
Constraint Answer Set Programming versus Satisfiability Modulo Theories Or Constraints versus Theories
Constraint answer set programming is a promising research direction that integrates answer set programming with constraint processing. It is often informally related to the field of Satisfiability Modulo Theories. Yet the exact formal link is obscured as the terminology and concepts used in these two research areas differ. In this paper, we make the link between these two areas precise.
متن کاملLecture 2 / 11 : Satisfiability Modulo Theories , Part I
Satisfiability modulo theories (SMT) is the study of the satisfiability of logical formulas (typically in first-order logic) with respect to (combinations of) background theories. The roots of SMT go back to work on automatic theorem proving and decision procedures for such logics performed in the 1970s and 80s. The defining characteristic of SMT solvers is their mode of operation: a satisfiabi...
متن کاملLyme Borreliosis Serology: Performance of Several Commonly Used Laboratory Diagnostic Tests and a Large Resource Panel of Well-Characterized Patient Samples.
The current recommendation for the laboratory confirmation of Lyme disease is serology-based diagnostics. Specifically, a standardized two-tiered testing (STTT) algorithm is applied that utilizes a first-tier immunofluorescence assay or enzyme immunoassay (EIA) that, if the result is positive or equivocal, is followed by second-tier immunoblotting. Despite the standardization and performance ac...
متن کاملPushing the Envelope of Optimization Modulo Theories with Linear-Arithmetic Cost Functions
In the last decade we have witnessed an impressive progress in the expressiveness and efficiency of Satisfiability Modulo Theories (SMT) solving techniques. This has brought previously-intractable problems at the reach of stateof-the-art SMT solvers, in particular in the domain of SW and HW verification. Many SMT-encodable problems of interest, however, require also the capability of finding mo...
متن کاملStochastic Local Search for Satisfiability Modulo Theories
Satisfiability Modulo Theories (SMT) is essential for many practical applications, e.g., in hardand software verification, and increasingly also in other scientific areas like computational biology. A large number of applications in these areas benefit from bit-precise reasoning over finite-domain variables. Current approaches in this area translate a formula over bit-vectors to an equisatisfia...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015